Interfacing Coq + SSReflect with GAP

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interfacing Coq + SSReflect with GAP

We report on an extendable implementation of the communication interface connecting Coq proof assistant to the computational algebra system GAP using the Symbolic Computation Software Composability Protocol (SCSCP). It allows Coq to issue OpenMath requests to a local or remote GAP instances and represent server responses as Coq terms.

متن کامل

A Computing Persistent Homology within Coq/SSReflect

Jónathan Heras, School of Computing, University of Dundee, UK Thierry Coquand, Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Sweden Anders Mörtberg, Department of Computer Science and Engineering, Chalmers University of Technology and University of Gothenburg, Sweden Vincent Siles, Department of Computer Science and Engineering, ...

متن کامل

Proof Pattern Search in Coq/SSReflect

ML4PG is an extension of the Proof General interface of Coq, allowing the user to invoke machine-learning algorithms and find proof similarities in Coq/SSReflect libraries. In this talk, we will show the recent ML4PG features in action, using examples from the standard SSReflect library and HoTT library. We will compare ML4PG with traditional Coq searching tools and dependency graphs.

متن کامل

Incidence Simplicial Matrices Formalized in Coq/SSReflect

Simplicial complexes are at the heart of Computational Algebraic Topology, since they give a concrete, combinatorial description of otherwise rather abstract objects which makes many important topological computations possible. The whole theory has many applications such as coding theory, robotics or digital image analysis. In this paper we present a formalization in the COQ theorem prover of s...

متن کامل

Formalization of Shannon's Theorems in SSReflect-Coq

The most fundamental results of information theory are Shannon’s theorems. These theorems express the bounds for reliable data compression and transmission over a noisy channel. Their proofs are non-trivial but rarely detailed, even in the introductory literature. This lack of formal foundations makes it all the more unfortunate that crucial results in computer security rely solely on informati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2012

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2012.06.003